Abstract: Routing algorithm occupies an important place in the QoS of NoC. This paper analyzes DyAD algorithm which may select a non-shortest route to make the hops increasing, to prolong the delay and to make the performance of the QoS decreasing rapidly. So the paper presents an improved algorithm based on DyAD. It can ensure as far as possible to choose the shortest path routing to guarantee service performances. Simulation results show that the improved algorithm can effectively reduce delays, improve performance and provide better assurance of QoS.

Key words: NoC, improved DyAD routing algorithm, QoS